addition chain造句

例句与造句

1. By definition, every addition chain is also an addition-subtraction chain, but not vice versa.
2. Since encryption uses a fixed known exponent an addition chain may be used to optimize the encryption process.
3. Scholz's conjecture, if true, would provide short addition chains for numbers of a special form, the Mersenne numbers.
4. It's possible to find addition sequence from vectorial addition chains and vice versa, so they are in a sense dual.
5. The problem of finding the shortest addition chain cannot be solved by dynamic programming, because it does not satisfy the assumption of optimal substructure.
6. It's difficult to find addition chain in a sentence. 用addition chain造句挺难的
7. The cost of producing an optimal addition chain can be amortized over the life of the public key, that is, it need only be computed once and cached.
8. The first example of where it does better is for " a " 15, where the binary method needs six multiplications but a shortest addition chain requires only five:
9. The " length " of an addition chain is the number of sums needed to express all its numbers, which is one less than the cardinality of the sequence of numbers.
10. There are also several methods to " approximate " a shortest addition chain, and which often require fewer multiplications than binary exponentiation; binary exponentiation itself is a suboptimal addition-chain algorithm.
11. In general, however, the determination of a minimal addition-subtraction chain ( like the problem of determining a minimum addition chain ) is a difficult problem for which no efficient algorithms are currently known.
12. That is, it is not sufficient to decompose the power into smaller powers, each of which is computed minimally, since the addition chains for the smaller powers may be related ( to share computations ).
13. Therefore, the length of the " shortest " addition-subtraction chain for " n " is bounded above by the length of the shortest addition chain for " n ".
14. Here, an addition chain is defined as a sequence of numbers, starting with 1, such that every number after the first can be expressed as a sum of two earlier numbers ( which are allowed to both be equal ).
15. Computing the length of the shortest addition chain that contains a given number can be done by dynamic programming for small numbers, but it is not known whether it can be done in polynomial time measured as a function of the length of the binary representation of.
16. The smallest " n " for which an addition-subtraction chain is shorter than the minimal addition chain is " n " = 31, which can be computed in only 6 additions ( rather than 7 for the minimal addition chain ):
更多例句：  下一页